External Difference Families from Finite Fields
نویسندگان
چکیده
منابع مشابه
Cyclotomic construction of strong external difference families in finite fields
Strong external difference family (SEDF) and its generalizations GSEDF, BGSEDF in a finite abelian group G are combinatorial designs raised by Paterson and Stinson [7] in 2016 and have applications in communication theory to construct optimal strong algebraic manipulation detection codes. In this paper we firstly present some general constructions of these combinatorial designs by using differe...
متن کاملDifference families from rings
Furino, S., Difference families from rings, Discrete Mathematics 97 (1991) 177-190. Some difference family constructions originating with Bose, Hanani and Wilson that require finite fields are modified to work in rings with unity. These ring constructions are then used to derive new classes of abelian and cyclic difference families with blocks size 4. These constructions are also used to provid...
متن کاملSquares and Difference Sets in Finite Fields
For infinitely many primes p = 4k+1 we give a slightly improved upper bound for the maximal cardinality of a set B ⊂ Zp such that the difference set B−B contains only quadratic residues. Namely, instead of the ”trivial” bound |B| ≤ √p we prove |B| ≤ √ p − 1, under suitable conditions on p. The new bound is valid for approximately three quarters of the primes p = 4k + 1.
متن کاملExistence and non-existence results for strong external difference families
We consider strong external difference families (SEDFs); these are external difference families satisfying additional conditions on the patterns of external differences that occur, and were first defined in the context of classifying optimal strong algebraic manipulation detection codes. We establish new necessary conditions for the existence of (n,m, k, λ)-SEDFs; in particular giving a near-co...
متن کاملSome Families of Permutation Polynomials over Finite Fields
We give necessary and sufficient conditions for a polynomial of the form x(1 + x + x + · · · + x) to permute the elements of the finite field Fq. Our results yield especially simple criteria in case (q − 1)/ gcd(q − 1, v) is a small prime.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Designs
سال: 2016
ISSN: 1063-8539
DOI: 10.1002/jcd.21531